A Graph-theoretic Framework for Model Reduction Using Time-scale Analysis of Complex Reaction Networks

نویسندگان

  • Udit Gupta
  • Aditya Bhan
  • Prodromos Daoutidis
چکیده

The orders of magnitude variation in rates typical in formulating a kinetic model for a complex reaction network, results in time scale separation that makes the system inherently stiff for simulation. In this work, a graph-theoretic framework is developed for the time scale decomposition of reaction systems into slow and fast time scales; the pseudo-species that evolve only in the slow time scale are identified. The reaction network is represented using a directed bi-partite graph and closed walks are used to identify interactions between species participating in the fast/equilibrated reactions. Subsequently, an algorithm which connects the closed walks to form the pseudo-species is utilized to eliminate the fast reaction rate terms. Two example reaction systems are considered to show the efficacy of the framework.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kinetic Mechanism Reduction Using Genetic Algorithms, Case Study on H2/O2 Reaction

For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...

متن کامل

Graph-theoretic Analysis of Complex Energy Integrated Networks ?

Complex process networks featuring multiple energy integration agents (processto-process heat exchangers) offer significant cost benefits while adding additional operational constraints. These networks show potential for multi-time scale dynamics owing to the presence of energy flows spanning multiple orders of magnitude. In previous work, we have developed a graph-theoretic framework to system...

متن کامل

Automatic Discovery of Technology Networks for Industrial-Scale R&D IT Projects via Data Mining

Industrial-Scale R&D IT Projects depend on many sub-technologies which need to be understood and have their risks analysed before the project can begin for their success. When planning such an industrial-scale project, the list of technologies and the associations of these technologies with each other is often complex and form a network. Discovery of this network of technologies is time consumi...

متن کامل

A Multi Objective Graph Based Model for Analyzing Survivability of Vulnerable Networks

In the various fields of disaster management, choosing the best location for the Emergency Support & Supply Service Centers (ESSSCs) and the survivability of the network that provides the links between ESSSCs and their environment has a great role to be paid enough attention. This paper introduces a graph based model to measure the survivability of the linking's network. By values computed for ...

متن کامل

Link Prediction using Network Embedding based on Global Similarity

Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015